Bisimulation Quantified Logics: Undecidability
نویسنده
چکیده
In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We investigate the properties of bisimulation quantifiers in general modal logics, particularly the expressivity and decidability, and seek to motivate the use of bisimulation quantified modal logics. This paper addresses two important questions: when are bisimulation quantified logics bisimulation invariant; and do bisimulation quantifiers always preserve decidability? We provide a sufficient condition for bisimulation invariance, and give two examples of decidable modal logics which are undecidable when augmented with bisimulation quantifiers. This is part of a program of study to characterize the expressivity and decidability of bisimulation quantified modal logics.
منابع مشابه
Bisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...
متن کاملUndecidability of Bisimulations in Concurrent Systems with Indeenite Number of Identical Processes
In this paper, we show that bisimulation equivalence between concurrent systems of the type described in 9] is undecidable for two logics | Linear Temporal Logic LT L and LT L without the nexttime operator. Such concurrent systems contain a control process and arbitrarily many identical user processes. These negative results indicate that it might be diicult to compare two such concurrent syste...
متن کاملComparing the Expressiveness of Description Logics
This work studies the expressiveness of the description logics that extend ALCreg (a variant of PDL) with any combination of the features: inverse roles, nominals, quantified number restrictions, the universal role, the concept constructor for expressing the local reflexivity of a role. We compare the expressiveness of these description logics w.r.t. concepts, positive concepts, TBoxes and ABox...
متن کاملBisimulation-Based Comparisons for Interpretations in Description Logics
We study comparisons between interpretations in description logics with respect to “logical consequences” of the form of semipositive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions similar to the ones of bisimulations. The simplest among the considered logics is a variant of PDL (propositional dynamic logic). The others extend that logic with ...
متن کاملUndecidability of first-order intuitionistic and modal logics with two variables
We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the twovariable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of pra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005